Logical Characterization of Petri Net !-languages
نویسندگان
چکیده
In this paper, we study some classes of Petri net deenable !-languages. We consider several types of accepting conditions on Petri nets, corresponding to those considered on nite automata in the theory of !-regular languages. Then, we establish a neat correspondence between the classes of Petri net deenable !-languages and the classes of nite automata deenable !-languages. Moreover, each class of Petri net deenable !-languages is characterized by logical formulas.
منابع مشابه
A Formal Petri Net Based Model for Antivirus Update Agent System
In this paper, a formal model for antivirus update agent system is presented based on mobile agent technology and predicate/transition Petri nets. The mobile agent system contains two mobile agents called DCA and UNA. It sends out agents to update antivirus on client computers in a network. Each agent takes on a specified responsibility. First, DCA roams through the network and check the last d...
متن کاملA Formal Petri Net Based Model for Antivirus Update Agent System
In this paper, a formal model for antivirus update agent system is presented based on mobile agent technology and predicate/transition Petri nets. The mobile agent system contains two mobile agents called DCA and UNA. It sends out agents to update antivirus on client computers in a network. Each agent takes on a specified responsibility. First, DCA roams through the network and check the last d...
متن کاملCharacterization of Petri Net Languages
This work treats the relationship between Petri Nets and languages. In 2003, Darondeau solved the Petri Net synthesis problem for a certain class of languages, i. e. for a given language L of this class he constructed a Petri Net generating the least Petri Net language containing L. Furthermore, he developed a decision procedure which tests for equality of these two languages. It is proved here...
متن کاملAlgebraic Characterization of Petri Net PomsetSemanticsHarro
Sets of pomsets are frequently used as a true-concurrency, linear-time semantics of Petri nets. For a Petri net N, let P(N), a set of pomsets, denote this pomset behaviour of N, and let P := fP(N) j N is a Petri netg denote the class of pomset behaviours of Petri nets, a generalization of L, the class of all Petri net languages. We present here an algebraic characterization for P, similar to th...
متن کاملPetri Net Models of Vhdl Control Statements
Hardware description languages are used to model logical systems on the behavioural level. The model describes the system as a set of interconnected processes, which can be executed in parallel and represents two aspects of the process – computation and control. Control can be modelled by Petri nets. Such a model is very useful to analyse, which state can be reached starting from a given system...
متن کامل